Set multi-covering via inclusion–exclusion
نویسندگان
چکیده
منابع مشابه
Set multi-covering via inclusion-exclusion
Set multi-covering is a generalization of the set covering problem where each element may need to be covered more than once and thus some subset in the given family of subsets may be picked several times for minimizing the number of sets to satisfy the coverage requirement. In this paper, we propose a family of exact algorithms for the set multi-covering problem based on the inclusionexclusion ...
متن کاملBubble Clustering: Set Covering via Union of Ellipses
We develop an algorithm called bubble clustering which attempts to cover a given set of points with the union of k ellipses of minimum total volume. This algorithm operates by splitting and merging ellipses according to an annealing schedule and does not assume any prior distribution on the data. We compare our algorithm with k-means and the EM algorithm for mixture of Gaussians. Numerical resu...
متن کاملPrize-Collecting Set Multi-Covering With Submodular Pricing
We consider a ground set E and a submodular function f : 2 → R acting on it. We first propose a Set Multi-Covering problem in which the value (price) of any S ⊆ E is f(S). We show that the Linear Program (LP) of this problem can be directly solved by applying a Submodular Function Minimization (SFM) algorithm on the dual LP. However, the main results of this study concern Prize-Collecting Multi...
متن کاملSet Covering Problems
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...
متن کامل2 Set Covering Problem
In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.05.020